Myhill-Nerode Fuzzy Congruences Corresponding to a General Fuzzy Automata
Authors
Abstract:
Myhill-Nerode Theorem is regarded as a basic theorem in the theories of languages and automata and is used to prove the equivalence between automata and their languages. The significance of this theorem has stimulated researchers to develop that on different automata thus leading to optimizing computational models. In this article, we aim at developing the concept of congruence in general fuzzy automata on the basis of Myhill-Nerode. To do so, we first define general fuzzy automata induced by fuzzy right congruence using the concept of fuzzy right congruences on a free monoid. Further, using the concept of language identified by an automaton we will show that in this induced automaton there exists an identifiable language if and only if there is an extension from fuzzy right congruence on a free monoid. As a result, this identified language is equivalent to the crisp language of the very automaton. We also define Nerode fuzzy right congruence and Myhill fuzzy congruence with max-min general fuzzy automata showing that the language identified by general fuzzy automata max-min is equivalent to the language identified by max-min general fuzzy automata induced by Nerode fuzzy right congruence. Finally, we elaborate the concepts through examples.
similar resources
Bipolar general fuzzy automata
In this paper, we define the notion of a bipolar general fuzzy automaton, then we construct some closure operators on the set of states of a bipolar general fuzzy automaton. Also, we construct some topologies on the set of states of a bipolar general fuzzy automaton. Then we obtain some relationships between them.
full textA Myhill-Nerode theorem for automata with advice
Consider an extension of the classical model of finite automata operating on finite strings in which the machine simultaneously reads a fixed advice tape — an infinite string A. A deterministic finite-string automaton with advice A is like a deterministic finite-string automaton, except that at step n the next state depends on the current state, the nth symbol of the input w ∈ Σ∗, and the nth s...
full textSome (Fuzzy) Topologies on General\ Fuzzy Automata
In this paper, by presenting some notions and theorems, we obtaindifferent types of fuzzy topologies. In fact, we obtain someLowen-type and Chang-type fuzzy topologies on general fuzzyautomata. To this end, first we define a Kuratowski fuzzy interioroperator which induces a Lowen-type fuzzy topology on the set ofstates of a max- min general fuzzy automaton. Also by provingsome theorems, ...
full textIrreducibility on General Fuzzy Automata
The aim of this paper is the study of a covering of a max-mingeneral fuzzy automaton by another, admissible relations, admissiblepartitions of a max-min general fuzzy automaton,$tilde{delta}$-orthogonality of admissible partitions, irreduciblemax-min general fuzzy automata. Then we obtain the relationshipsbetween them.
full textHYPERGROUPS AND GENERAL FUZZY AUTOMATA
In this paper, we first define the notion of a complete general fuzzyautomaton with threshold c and construct an $H_{nu}$- group, as well as commutativehypergroups, on the set of states of a complete general fuzzy automatonwith threshold c. We then define invertible general fuzzy automata, discussthe notions of “homogeneity, “separation, “thresholdness connected, “thresholdnessinner irreducible...
full textMy Resources
Journal title
volume 6 issue 25
pages 5- 22
publication date 2020-08-22
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023